Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2

Source URL: www-cc.cs.uni-saarland.de

• Complexity classes
• Computational complexity theory
• Mathematical optimization
• Analysis of algorithms
• NP-complete problems
• Smoothed analysis
• IP
• PP
• NP
• Time complexity
• Average-case complexity
• Boolean satisfiability problem

CS369N: Beyond Worst-Case Analysis Lecture #7: Smoothed Analysis∗ Tim Roughgarden† November 30,

Source URL: theory.stanford.edu

• Operations research
• Computational complexity theory
• Linear programming
• Mathematical optimization
• Artificial neural networks
• Perceptron
• Simplex algorithm
• Smoothed analysis
• Algorithm
• Simplex
• Time complexity
• Polynomial

Contribution to the modeling of complex physical systems described by PDE1: a 2D multiagent model for convectiondiffusion Jean-Marie Dembele Université Cheikh Anta Diop – IRD (UR GEODES, ESPACE) Laboratoire Modélisat

Source URL: necsi.edu

• Calculus
• Mathematical analysis
• Physics
• Transport phenomena
• Diffusion
• Computational fluid dynamics
• Functions of space and time
• Partial differential equations
• Smoothed-particle hydrodynamics
• Molecular diffusion
• Differential equation
• Reactiondiffusion system

Introduction to Time Series Analysis. LectureReview: The periodogram, the smoothed periodogram. 2. Other smoothed spectral estimators. 3. Consistency. 4. Asymptotic distribution.

Source URL: www.stat.berkeley.edu

• Statistics
• Frequency domain analysis
• Estimator
• Spectral density estimation
• Mathematical analysis
• Probability
• Variance
• Probability distributions

Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Work of Daniel A. Spielman Gil Kalai Dan Spielman has made groundbreaking contributions in theoretical computer

Source URL: www.icm2010.in

• Mathematics
• Computational complexity theory
• Computer science
• Analysis of algorithms
• Linear programming
• Operations research
• Mathematical optimization
• Smoothed analysis
• KleeMinty cube
• Simplex algorithm
• Daniel Spielman
• Algorithm

2008 G¨odel Prize Citation The 2008 G¨ odel Prize for outstanding papers in the area of theoretical computer science is awarded to Smoothed analysis of algorithms: Why the simplex algorithm usually

Source URL: www.fmi.uni-stuttgart.de

Smoothed Analysis of Left-To-Right Maxima with Applications∗ Valentina Damerow† Bodo Manthey‡

Source URL: www.cs.uni-paderborn.de

Smoothed Gradients for Stochastic Variational Inference David Blei Department of Computer Science Department of Statistics Columbia University

Source URL: papers.nips.cc

• Statistics
• Mathematical analysis
• Statistical theory
• Stochastic optimization
• Computational statistics
• Estimation theory
• M-estimators
• Stochastic gradient descent
• Bias of an estimator
• Mathematical optimization
• Variational Bayesian methods
• Biasvariance tradeoff

Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method David Arthur∗ Stanford University

Source URL: www.cs.duke.edu

A CONVERGENT ADAPTIVE ELEMENT FREE GALERKIN ALGORITHM BASED ON THE BACKGROUND MESH Maryam Kamranian Department of Applied Mathematics, Amirkabir University of Technology, Tehran, Iran The Element Free Galerkin (EFG) met

Source URL: math.ipm.ac.ir

• Numerical analysis
• Computational fluid dynamics
• Partial differential equations
• Finite element method
• Continuum mechanics
• Meshfree methods
• Boris Galerkin
• Smoothed finite element method
• Mathematical analysis
• Mathematics
• Computational science